Packing problems - PDFSEARCH.IO - Document Search Engine

Packing problems
Results: 74

#	Item
41	Packing Resizable Items with Application to Video Delivery over Wireless Networks∗ Sivan Albagli-Kim† Leah Epstein‡ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-07-08 12:40:54 NP-complete problems Operations research Combinatorial optimization Bin packing problem Knapsack problem Packing problem Algorithm Theoretical computer science Computational complexity theory Mathematics
42	References for the Colloquium Talk “OPTIMAL PACKINGS: PROBLEMS FOR THE AGES” presented by Salvatore Torquato, Princeton University at the Aspen Center for Physics, June 29, 2006 Abstract Add to Reading List Source URL: cherrypit.princeton.edu Language: English - Date: 2008-12-08 18:20:07 Abstract algebra Sphere packing Packing problem Random close pack Leech lattice Kepler conjecture Crystal Discrete geometry Mathematics Geometry
43	PDF Document Add to Reading List Source URL: www.mansci.ovgu.de Language: English - Date: 2012-05-21 04:38:13 Operations research Combinatorial optimization Packaging Discrete geometry NP-complete problems Knapsack problem Bin packing problem Packing problem Cutting stock problem Theoretical computer science Computational complexity theory Mathematics
44	Maejo Int. J. Sci. Technol. 2015, 9(01), Maejo International Journal of Science and Technology ISSNAvailable online at www.mijst.mju.ac.th Add to Reading List Source URL: www.mijst.mju.ac.th Language: English - Date: 2015-04-02 23:15:13 Containers Operations research Shipping containers NP-complete problems Discrete geometry Packing problem Containerization Knapsack problem Wooden box Theoretical computer science Computational complexity theory Mathematics
45	Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes NP-complete problems Bin packing problem Approximation algorithms Discrete geometry Packing problem Polynomial-time approximation scheme Time complexity Bin Theoretical computer science Computational complexity theory Applied mathematics
46	Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if, Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 NP-complete problems Operations research Bin packing problem Approximation algorithm Job shop scheduling Greedy algorithm Algorithm Theoretical computer science Mathematics Applied mathematics
47	Data Locality Problems and Colored Bin Packing Andy Twigg (Oxford), Eduardo Xavier (Campinas, Brazil) May 11, 2009 Andy Twigg (Oxford), Eduardo Xavier (Campinas, Brazil) Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:11 Operations research Job shop scheduling Campinas Approximation algorithm Bin Theoretical computer science Applied mathematics Bin packing problem
48	Advanced Algorithms – COMS31900Lecture 18 Approximation Algorithms (part three) (Fully) Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 NP-complete problems Dynamic programming Subset sum problem Bin packing problem Approximation algorithm Complexity classes Combinatorial optimization NP Partition problem Theoretical computer science Computational complexity theory Applied mathematics
49	NP-completeness recap Advanced Algorithms – COMS31900 • NP is the class of problems we can Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21